Variable gap penalty for protein sequence–structure alignment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A better gap penalty for pairwise SVM

SVM-Pairwise was a major breakthrough in remote homology detection techniques, significantly outperforming previous approaches. This approach has been extensively evaluated and cited by later works, and is frequently taken as a benchmark. No known work however, has examined the gap penalty model employed by SVM-Pairwise. In this paper, we study in depth the relevance and effectiveness of SVM-Pa...

متن کامل

Generalized affine gap costs for protein sequence alignment.

Based on the observation that a single mutational event can delete or insert multiple residues, affine gap costs for sequence alignment charge a penalty for the existence of a gap, and a further length-dependent penalty. From structural or multiple alignments of distantly related proteins, it has been observed that conserved residues frequently fall into ungapped blocks separated by relatively ...

متن کامل

PLANAR: RNA Sequence Alignment using Non-Affine Gap Penalty and Secondary Structure

An important component of bioinformatics research is aimed at finding evolutionary relationships among species, since it allows us to better understand various important biological functions as they emerged in these species. These tools simultaneously trace the associated evolutionary history. In this context, sequence alignment is commonly used to understand similarities among the species by c...

متن کامل

Computational Biology Lecture 6: Affine Gap Penalty Function, Multiple Sequence Alignment

We saw earlier how we can use a concave gap penalty function γ, i.e. one that satisfies γ(x+1)−γ(x) ≤ γ(x)−γ(x−1), as a more realistic model for penalizing gaps. This was at the expense of increasing the time complexity of our dynamic programming algorithm. With a concave gap penalty function, the new DP algorithm requires O(mn + nm) time, as compared to the O(mn) time bound of previous algorit...

متن کامل

Eliminating Duality Gap by α Penalty

In this short and self contained paper we are proposing a simple penalty, which is a modification on the constraint set. We show that duality gap is eliminated under certain conditions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Protein Engineering, Design and Selection

سال: 2006

ISSN: 1741-0134,1741-0126

DOI: 10.1093/protein/gzj005